Higher Order Gradients of Monogenic Functions
نویسندگان
چکیده
Given a monogenic function on the quaternionic algebra \({{\mathbb {H}}}\), Clifford {R}}}_n\) or octonionic {O}}}\) we prove that \(|\nabla ^m f|^\alpha \) is subharmonic for some \(\alpha >0\) where \(\nabla f\) mth order gradient of f. We find also optimal value \). This generalization result Calderon and Zygmund.
منابع مشابه
Approximation of monogenic functions by higher order Szegö kernels on the unit ball and half space
We study the adaptive decomposition of functions in the monogenic Hardy spaces H2 by higher order Szegö kernels under the framework of Clifford algebra and Clifford analysis, in the context of unit ball and half space. This is a sequel and a higher-dimensional generalization of our recent study on the complex Hardy spaces.
متن کاملHigher Order Spt-functions
Andrews’ spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order symmetrized crank and rank moment functions. This implies an inequality between crank and rank moments that was only known previously for sufficiently large n and...
متن کاملSolving Higher Order Functions
In this paper we extend the class of energy functions for which the optimal α-expansion and αβswap moves can be computed in polynomial time. Specifically, we introduce a novel family of higher order clique potentials and show that the expansion and swap moves for any energy function composed of these potentials can be found by minimizing a submodular function. We also show that for a subset of ...
متن کاملTesting Higher Order Functions
Automatic testing of first order functions works fine. Testing higher order functions automatically is more troublesome, it is harder to generate the functions needed as argument automatically, and these generated functions cannot be shown when a counterexample is found. Nevertheless, higher order functions can contain errors and hence need to be tested. In this paper we present effective and e...
متن کاملHigher Order Functions Considered Unnecessary for Higher Order Programming
It is often claimed that the essence of functional programming is the use of functions as values, i.e., of higher order functions, and many interesting examples have been given showing the power of this approach. Unfortunately, the logic of higher order functions is diicult, and in particular, higher order uniication is undecidable. Moreover (and closely related), higher order expressions are n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geometric Analysis
سال: 2021
ISSN: ['1559-002X', '1050-6926']
DOI: https://doi.org/10.1007/s12220-021-00734-w